An O(n3/2sqrt(log n)) Algorithm for Sorting by Reciprocal Translocations
نویسندگان
چکیده
We prove that sorting by reciprocal translocations can be done in O(n p log(n)) for an n-gene genome. Our algorithm is an adaptation of the Tannier et. al algorithm for sorting by reversals. This improves over the O(n) algorithm for sorting by reciprocal translocations given by Bergeron et al.
منابع مشابه
log(n)) algorithm for sorting by reciprocal translocations
We prove that sorting by reciprocal translocations can be done in O(n3/2 √ log(n)) for an n-gene genome. Our algorithm is an adaptation of the algorithm of Tannier, Bergeron and Sagot for sorting by reversals. This improves over the O(n3) algorithm for sorting by reciprocal translocations given by Bergeron, Mixtacki and Stoye.
متن کاملAn O ( n 3 / 2 √ log ( n ) ) algorithm for sorting by reciprocal translocations
Article history: Available online xxxx
متن کاملSorting genomes by translocations and deletions.
Given two signed multi-chromosomal genomes Pi and Gamma with the same gene set, the problem of sorting by translocations (SBT) is to find a shortest sequence of translocations transforming Pi to Gamma, where the length of the sequence is called the translocation distance between Pi and Gamma. In 1996, Hannenhalli gave the formula of the translocation distance for the first time, based on which ...
متن کاملImproved Routing and Sorting on Multibutter ies
This paper shows that an N -node AKS network (as described by Paterson) can be embedded in a 3N 2 -node degree-8 multibutter y network with load 1, congestion 1, and dilation 2. The result has several implications, including the rst deterministic algorithms for sorting and nding the median of n logn keys on an n-input multibutter y in O(logn) time, a work-e cient algorithm for nding the median ...
متن کاملA simpler and faster 1.5-approximation algorithm for sorting by transpositions
An important problem in genome rearrangements is sorting permutations by transpositions. The complexity of the problem is still open, and two rather complicated 1.5-approximation algorithms for sorting linear permutations are known (Bafna and Pevzner, 98 and Christie, 99). The fastest known algorithm is the quadratic algorithm of Bafna and Pevzner. In this paper, we observe that the problem of ...
متن کامل